Sperm Motility Algorithm for Solving Fractional Programming Problems under Uncertainty
نویسندگان
چکیده
This paper investigated solving Fractional Programming Problems under Uncertainty (FPPU) using Sperm Motility Algorithm. Sperm Motility Algorithm (SMA) is a novel metaheuristic algorithm inspired by fertilization process in human, was proposed for solving optimization problems by Osama and Hezam [1]. The uncertainty in the Fractional Programming Problem (FPP) could be found in the objective function coefficients and/or the coefficients of the constraints. The uncertainty in the coefficients can be characterised by two methods. The first method is fuzzy logic-based alpha-cut analysis in which uncertain parameters are treated as fuzzy numbers leading to Fuzzy Fractional Programming Problems (FFPP). The second is Monte Carlo simulation (MCS) in which parameters are treated as random variables bound to a given probability distribution leading to Probabilistic Fractional Programming Problems (PFPP). The two different methods are used to revise the trustiness in the transformation to the deterministic domain. A comparative study of the obtained result using SMA with genetic algorithm and the two SI algorithms on a selected benchmark examples is carried out. A detailed comparison is induced giving a ranked recommendation for algorithms and methods proper for solving FPPU. Keywords—Sperm Motility Algorithm; Fractional Programming; Uncertainty; Fuzzy Programming; Monte Carlo Method
منابع مشابه
Global optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملModified FGP approach and MATLAB program for solving multi-level linear fractional programming problems
In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...
متن کامل